Owner-Free Distributed Symmetric Searchable Encryption Supporting Conjunctive Queries

نویسندگان

چکیده

Symmetric Searchable Encryption (SSE), as an ideal primitive, can ensure data privacy while supporting retrieval over encrypted data. However, existing multi-user SSE schemes require the owner to share secret key with all query users or always be online generate search tokens. While there are some solutions this problem, they have at least one weakness, such non-supporting conjunctive query, result decryption assistance of owner, and unauthorized access. To solve above issues, we propose O wner-free Di stributed S ymmetric searchable encryption C onjunctive (ODiSC). Specifically, first evaluate Learning-Parity-with-Noise weak Pseudorandom Function (LPN-wPRF) in dual-cloud architecture tokens free from sharing being online. Then, provide fine-grained distributed using additive symmetric-key hidden vector encryption. Finally, formal security analysis empirical performance evaluation demonstrate that ODiSC is adaptively simulation-secure efficient.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Searchable Encryption Supporting General Boolean Expression Queries

BSSE algorithms  Each keyword is considered as a vector in order to perform inner product during the search phase.  Boolean symmetric searchable encryption BSSE is mainly based on the orthogonalization of the keyword field according to the GramSchmidt process.  Searchable encryption: Searching encrypted keywords using encrypted queries (trapdoor) in order to retrieve encrypted documents with...

متن کامل

Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries

This work presents the design and analysis of the first searchable symmetric encryption (SSE) protocol that supports conjunctive search and general Boolean queries on outsourced symmetrically-encrypted data and that scales to very large databases and arbitrarily-structured data including free text search. To date, work in this area has focused mainly on single-keyword search. For the case of co...

متن کامل

Garbled Searchable Symmetric Encryption

In a searchable symmetric encryption (SSE) scheme, a client can keyword search over symmetrically-encrypted files which he stored on the server (ideally without leaking any information to the server). In this paper, we show the first multiple keyword search SSE scheme such that even the search formula f (AND, OR and so on) is kept secret. Our scheme is based on an extended garbled circuit satis...

متن کامل

Substring-Searchable Symmetric Encryption

In this paper, we consider a setting where a client wants to outsource storage of a large amount of private data and then perform substring search queries on the data – given a data string s and a search string p, find all occurrences of p as a substring of s. First, we formalize an encryption paradigm that we call queryable encryption, which generalizes searchable symmetric encryption (SSE) an...

متن کامل

Verifiable Searchable Symmetric Encryption

OF A DISSERTATION SUBMITTED TO THE FACULTY OF THE DEPARTMENT OF COMPUTER SCIENCE IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF DOCTOR OF PHILOSOPHY COMPUTER SCIENCE UNIVERSITY OF MASSACHUSETTS LOWELL 2013 Dissertation Supervisor: Jie Wang, Ph.D. Professor and Chair, Department of Computer Science Cloud storage has become increasingly prevalent in recent years. It provides a conve...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM Transactions on Storage

سال: 2023

ISSN: ['1553-3077', '1553-3093']

DOI: https://doi.org/10.1145/3607255